ata187 i1

MATLAB image segmentation algorithm Source code1. Image inversionThe MATLAB program is implemented as follows:I=imread (' xian.bmp ');J=double (I);j=-j+ (256-1); % Image Inversion Linear transformationH=uint8 (J);Subplot (1,2,1), Imshow (I);Subplot (1,2,2), Imshow (H);2. Gray-Scale linear transformationThe MATLAB program is implemented as follows:I=imread (' xian.bmp ');Subplot (2,2,1), Imshow (I);Title (' original image ');Axis ([50,250,50,200]);Axis on; % Display coordinate systemI1=rgb2gray (

From http://blog.sina.com.cn/s/blog_a4034b2801013q5t.html MATLAB Image Segmentation Algorithm source code 1. Image InversionThe MATLAB program is implemented as follows:I =imread('xian.bmp ');J = double (I );J =-J + (256-1); % linear inversion of ImageH = uint8 (j );Subplot (1, 2), imshow (I );Subplot (1, 2), imshow (h ); 2. gray linear transformationThe MATLAB program is implemented as follows:I =imread('xian.bmp ');Subplot (2, 2, 1), imshow (I );Title ('original image ');Axis ([50,250, 50,200]

For a given dictionary, the following [html] i1 ii i1 one ii i1 i1 one ii i1 ii i1 ii i1 i1 1111 ii i4 ii

Smo_svm.pas: {Author: LiuWebsite: www.aivisoft.netE-mail: geo.cra@gmail.comThis code is translated from a p-code by J. Platt.This code shows a smo (sequential minimal optimization) SVM.Enjoy fast and efficient SVM!This code now provide 4 different kernels.}Unit smo_svm; Interface UsesWindows, sysutils, variants, classes, graphics, math, unitypes; TypeTvector = recordItems: tsingleextendedarray;Target: extended;End; Tvectorarray = array of tvector; Tkernels = (kllinear, klgsrbf, klexprbf, klpolyn

enable you to win the game as soon as possible (this is the key, to be clear). The calculation method of the evaluation points of the leaf nodes in the Strategy tree (winning, losing or draw evaluation method) is given only in the topic, how to calculate the evaluation score of each non-leaf node in the strategy tree?The answer is to use the depth-first search for the entire strategy tree to post-sequence traversal, so that the evaluation of the leaf node in the policy tree, the evaluation of t

); in for(inti =1; I i) { -scanf" %d%d%d", a[i].x, AMP;A[I].Y, a[i].z); to for(intj =1; J j) { +COST[I][J] = cost[j][i] = (a[i].x-a[j].x) * (a[i].x-a[j].x) + (A[I].Y-A[J].Y) * (A[I].Y-A[J].Y) + (a[i].z-a[j].z) * (A [I].z-a[j].z); - } the } * edge s1, S2, S3; $ intans, res =0, x1, x2, y1, y2, len1, len2;//X1 Y1 is a triangular face with different sides of the ends len1 for the isosceles triangle of the waistPanax Notoginseng for(intI1 =1;

First, let's look at a piece of code (using JDK 5), as follows: public class test { Public static void main (string [] ARGs ){ Integer I1 = 127; Integer I2 = 127; If (I1 = I2) System. Out. println ("Equal! "); Else System. Out. println ("not equal! "); } } The output result must be "Equal !". Now, change the I1 and I2 values from 127 to 128 to see what will happe

; Int G [ 6 ];} Edge [N]; Int CNT, pre [N]; Int Flag1; Void Hash (LL key, Int K [ 6 ]) { For ( Int P = pre [Key]; P! =- 1 ; P = Edge [p]. Next ){ Int FF = 0 ; For ( Int I = 0 ; I 6 ; I ++ ) If (K [I]! =Edge [p]. g [I]) {FF = 1 ; Break ;} If (FF = 0 ) {Flag1 = 1 ; Return ;}} For ( Int I =0 ; I 6 ; I ++ ) Edge [CNT]. g [I] = K [I]; edge [CNT]. Next = Pre [Key]; Pre [Key] = CNT ++ ;} Int Main (){ Int N; While (Scanf ( " % D " , N )! =EOF ){ Int K [ 6 ], TK [ 6 ], MK

Both the Apriori algorithm and the fptree algorithm are the Association Rule Mining Algorithms in Data Mining. They process the simplest single-dimension boolean association rules. Apriori algorithm The Apriori algorithm is the most influential algorithm used to mine frequent item sets of Boolean association rules. It is based on the fact that algorithms use a prior knowledge of the nature of frequent item sets. Apriori uses an iteration method called layer-by-layer search,K-Item Set for explora

T100T200T300T400T500T600T700T800T900 I1, I2, I5I2, I4I2, I3I1, I2, I4I1, I3I2, I3I1, I3I1, I2, I3, I5I1, I2, I3 The basic process of an algorithm is as follows: First, scan all transactions, get 1-item set C1, filter out the item set that does not meet the condition according to the support requirement, and get the frequent 1-item set. Perform the following recursive operations: Known frequent K-item set (frequent

=zeros (a+2,b+2);B=zeros (A,B); % mark Sample, indicating whether the pixel has been activated;Y=zeros (A,B);Edge=zeros (A,B); Numberofaera=zeros (A,B); Numberofaera_1=zeros (A,B);num_1=0; num=0;N=1;while (sum (B)) ~=xa*ya, it should be noted that the 128*128 image is used.For i0=2:a+1For i1=2:b+1V=[s (i0-1,i1-1) s (i0-1,i1) s (i0-1,

are exactly the same. We have to be clear about this. In conclusion, it is important to remember that neither the const nor the int will have any effect on semantics before they are written. With this concept, let's look at these two guys: const INT *PI And int const *PI Do they have different semantics, according to normal logic? Oh, just remember one point: int and the const which before which put is the same, like const int IC; and int const IC; In other words, th

L,r that is the left and right endpoints.So how do you divide the line tree? We use the idea of two points, that is, each time we take a half, then the next operation, so that the ease of operation and the complexity of time. Because the segment tree is derived from two points, the segment tree is a binary tree. This also facilitates the search for the son. Below is a diagram of the line tree, which is useful for understanding:achievements : Only know the model is not enough, the process of ach

path code: http://www.newnew.cn/newnewindex.aspx Output demo code: http://www.maifp.com/aaa/test.php The following is the function code. The code is as follows: Function formaturl ($ l1, $ l2 ){If (preg_match_all ("/(] + src = \" ([^ \ "] +) \" [^>] *>) | (] + href = \ "([^ \"] +) \ "[^>] *>) | (] + src = '([^'] +) '[^>] *>) | (] + href =' ([^ '] +)' [^>] *>)/I ", $ l1, $ regs )){Foreach ($ regs [0] as $ num => $ url ){$ L1 = str_replace ($ url, lIIIIl ($ url, $ l2), $ l1 );}}Return $ l1;}

double quotation marks CHR (34) and single quotation marks CHR (39)$ I1 = str_replace (CHR (34), "", $ I2 );$ I1 = str_replace (CHR (39), "", $ I1 );} Else {Return $ L1;}$ Url_parsed = parse_url ($ l2 );$ Scheme = $ url_parsed ["Scheme"];If ($ scheme! = ""){$ Scheme = $ scheme ."://";}$ Host = $ url_parsed ["host"];$ L3 = $ scheme. $ host;If (strlen ($ l3) = 0){

,integer,long,character,boolean; Integer I1 = +=; System.out.println (I1==i2); // Output TrueThese 5 wrapper classes create the corresponding type of cached data for the value [-128,127] by default, but beyond this range the new object is still created. // integer Cache code: public static Integer valueOf (int i) { assert integercache.high >= 127; if (i >= integercache.low i Integercache.

------------ Original path code: http://www.newnew.cn/newnewindex.aspx Output demo code: http://www.maifp.com/aaa/test.php The following is the function code. The code is as follows: Function formaturl ($ l1, $ l2 ){If (preg_match_all ("/(] + src = \" ([^ \ "] +) \" [^>] *>) | (] + href = \ "([^ \"] +) \ "[^>] *>) | (] + src = '([^'] +) '[^>] *>) | (] + href =' ([^ '] +)' [^>] *>)/I ", $ l1, $ regs )){Foreach ($ regs [0] as $ num => $ url ){$ L1 = str_replace ($ url, lIIIIl ($ url, $ l2),

(! File_exists ($ this-> filename )){$ This-> data_ts = 0;$ This-> log. = $ this-> filename. "does not exist Return false;}$ This-> data_ts = filemtime ($ this-> filename );Return true;}Function formaturl ($ l1, $ l2 ){If (preg_match_all ("/(] + src =" ([^ "] +)" [^>] *>) | (Foreach ($ regs [0] as $ num => $ url ){$ L1 = str_replace ($ url, $ this-> lIIIIl ($ url, $ l2), $ l1 );}}Return $ l1;} Function lIIIIl ($ l1, $ l2 ){If (preg_match ("/(. *) (href | src) = (. + ?) (|/> |>). */I ", $ l1, $

2011.2.19 AM Learn about yangzhongke. net Video c # knowledge points summarized after the basics: (these knowledge points are all the content that Mr. Yang zhongke mentioned in the lecture or on the courseware. I will collect and organize them, I hope to share with you what you want to learn. network friends help) 1. Use C # To compile a 10 + 20 =? Small Program: Public static void Main (tring [] args) { Int i1 = 10; Int i2 = 20; Int i3 =

First, the matrixMat i,img,i1,i2,dst,a,b;Double K,alpha;Scalar s; 1. Additioni=i1+i2;//equals Add (I1,i2,i);Add (I1,i2,dst,mask,dtype);Scaleadd (I1,SCALE,I2,DST);//dst=scale*i1+i2; 2. SubtractionAbsdiff (